Security of Blind Discrete Log Signatures against Interactive Attacks
نویسنده
چکیده
منابع مشابه
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
We provide evidence that the unforgeability of several discrete-log based signatures like Schnorr signatures cannot be equivalent to the discrete log problem in the standard model. This contradicts in nature well-known proofs standing in weakened proof methodologies, in particular proofs employing various formulations of the Forking Lemma in the random oracle Model. Our impossibility proofs app...
متن کاملMachine-Checked Security Proofs of Cryptographic Signature Schemes
Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e. the hypothesis that there is no way to obtain knowledge about the plaintext pertaining to a ciphertext without knowing the key. A model that does not require the perfect cryptography assumption is the generic model and the rand...
متن کاملSecurity of Discrete Log Cryptosystems in theRandom Oracle + Generic ModelClaus
Based on a novel proof model we prove security for simple discrete log cryptosystems for which security has been an open problem. We consider a combination of the random oracle (RO) model and the generic model. This corresponds to assuming an ideal hash function H given by an oracle and an ideal group of prime order q, where the binary encoding of the group elements is useless for cryptographic...
متن کاملTwo Simple Attacks on a Blind Signature Scheme
A blind signature scheme allows a user to obtain a signature on a given message without revealing any information about the message to the signer. The idea of blind signature was first introduced by Chaum at CRYPTO 1982. Blind signatures can be used in many applications, such as e-voting. Recently, Chakraborty and Mehta proposed a new blind signature scheme (Chakraborty-Mehta scheme) based on t...
متن کاملA Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need five data exchanges between the signer and the user or are limited to issue only logarithmically many signatures in terms of a security parameter. This paper presents an efficient blind signature scheme that allows a polynomial number of signatures to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001